Sets of Matrices All Infinite Products of Which Converge

نویسندگان

  • Ingrid Daubechies
  • Jeffrey C. Lagarias
  • Richard A. Brualdi
  • JEFFREY C. LAGARIAS
چکیده

An infinite product IIT= lMi of matrices converges (on the right) if limi __ M, . . . Mi exists. A set Z = (Ai: i > l} of n X n matrices is called an RCP set (rightconvergent product set) if all infinite products with each element drawn from Z converge. Such sets of matrices arise in constructing self-similar objects like von Koch’s snowflake curve, in various interpolation schemes, in constructing wavelets of compact support, and in studying nonhomogeneous Markov chains. This paper gives necessary conditions and also some sufficient conditions for a set X to be an RCP set. These are conditions on the eigenvalues and left eigenspaces of matrices in 2 and finite products of these matrices. Necessary and sufficient conditions are given for a finite set Z to be an RCP set having a limit function M,(d) = rIT= lAd,, where d = (d,, . , d,, . .>, which is a continuous function on the space of all sequences d with the sequence topology. Finite RCP sets of column-stochastic matrices are completely characterized. Some results are given on the problem of algorithmically deciding if a given set X is an RCP set.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tight Bounds for Consensus Systems Convergence

We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set by looking only at finite or periodic products. It is known that when the matrices of the set have a common nonincreasing polyhedral norm, all infinite products converge to zero if and only if all infinite periodic products with periods smaller than a certain value converge to zero. Moreover, ...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Non-additive Lie centralizer of infinite strictly upper triangular matrices

‎Let $mathcal{F}$ be an field of zero characteristic and $N_{infty‎}(‎mathcal{F})$ be the algebra of infinite strictly upper triangular‎ ‎matrices with entries in $mathcal{F}$‎, ‎and $f:N_{infty}(mathcal{F}‎)rightarrow N_{infty}(mathcal{F})$ be a non-additive Lie centralizer of $‎N_{infty }(mathcal{F})$; that is‎, ‎a map satisfying that $f([X,Y])=[f(X),Y]$‎ ‎for all $X,Yin N_{infty}(mathcal{F})...

متن کامل

Bounded Semigroups of Matrices

In this note are proved two conjectures of Daubechies and Lagarias. The first asserts that if Z is a bounded set of matrices such that all left infinite products converge, then 8 generates a bounded semigroup. The second asserts the equality of two differently defined joint spectral radii for a bounded set of matrices. One definition involves the conventional spectral radius, and one involves t...

متن کامل

FUZZY SOFT MATRIX THEORY AND ITS APPLICATION IN DECISION MAKING

In this work, we define fuzzy soft ($fs$) matrices and theiroperations which are more functional to make theoretical studies inthe $fs$-set theory. We then define products of $fs$-matrices andstudy their properties. We finally construct a $fs$-$max$-$min$decision making method which can be successfully applied to theproblems that contain uncertainties.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001